// Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) { cerr << "\033[32;1m" << #x << " -> "; err(x); }
void err() { cerr << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }
#else
#define dbg(...)
#endif

#define sz(x) ((int)x.size())

typedef long long LL;

const int N = 1e5+50;

int n, a[N];


int main(int argc, char const *argv[]) {
    // code
    int t;
    scanf("%d", &t);
    for (int kk=0; kk<t; ++kk) {
        int b;
        scanf("%d%d", &n, &b);
        for (int i=0; i<n; ++i)
            scanf("%d", &a[i]);
        int ans = 0;
        sort(a, a+n);
        for (int i=0; i<n; ++i) {
            if (b < a[i])
                break;
            b -= a[i];
            ++ans;
        }

        printf("Case #%d: %d\n", kk+1, ans);
    }
    return 0;
}
